A High Speed Motion Estimator Using 2-D Log Search Algorithm

نویسندگان

  • Nam Ling
  • Rajesh Advani
چکیده

This paper describes the design of a high speed motion estimator using the Z-D log search algorithm. The architecture consists of 5 simple processing elements (PE) where each PE is capable of computing the sum-of-absolute-difference (SAD) to exploit the parallelism. For each step in the 2-D log search procedure, the 5 SADs of the 5 search points are computed in parallel. The design is implemented using Verilog and synthesized using Synopsys. Simulations show that the architecture is able to generate the motion vector for each 16*16 macroblock in 14.58~s for 3-step log search, and 24.30~s for 5step log search. The architecture is thus well suited for encoding MPEG2 video up to MP@ML. The architecture is divided into two independent units: a SAD unit and a Motion Vector Generation unit (MVG). The current frame is input into the SAD in real-time. The reference frame stored in memory is also fed to the SAD. For an MPEG application macroblocks (MB) of 16* 16 pixels are used as units for motion estimation. The SAD unit computes the SADs between the current macroblock and the reference macroblock. The MVG unit generates the minimum SAD for each step in the 2-D log search procedure. This result is fed back to the SAD unit so that the PEs within it can appropriately change its search points. Eventually, the MVG unit outputs the coordinates of the motion vector, MOTION-X and MOTION-Y, of the macroblock in question. In the SAD unit, based on the search points, five corresponding pixels, pixrefl, pixret2, pixref3, pixref4, pixref5, from five locations in the reference frame memory are fed to the five PEs. Each PE computes the absolute difference between the current MB’s pixel and the reference MB’s pixel pointed to by a search point. The process repeats until all 256 pixels in a MB are compared and five SADs are obtained and stored in five SAD registers. The outputs of the PE’s, SAD registers, SADI, SAD5 SAD3, SAD4, SAD& are fed to the MVG unit to determine which one is the minimum. The MVG unit uses one 16-bit comparator to determine which of SAD& SAD2, SAD3, SAD4, SADS, is the minimum.The result is fed back to the SAD unit for another round of computation. Execution continues until the minimum SAD is in SADl, the SAD register of the center PE. At this time, the distance between search points can be reduced if needed (say to f 1 or to k 0.5 pixels) and the process repeats. Finally, the X and Y registers of SAD1 hold the motion vector and is output from the chip.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Parameters Assignment of Electric Train Controller by Using Gravitational Search Optimization Algorithm

The speed profile of the train will be determined according to criteria such as safety, travel convenience, and the type of electric motor used for traction. Due to the passengers and cargo on the train, the electric train load is constantly changing. This will require reassigning the speed controller’s parameters of the electric train. For this purpose, the Gravitational Search optimization Al...

متن کامل

Harmonics Estimation in Power Systems using a Fast Hybrid Algorithm

In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...

متن کامل

Approximating the step change point of the process fraction non conforming using genetic algorithm to optimize the likelihood function

Control charts are standard statistical process control (SPC) tools for detecting assignable causes. These charts trigger a signal when a process gets out of control but they do not indicate when the process change has begun. Identifying the real time of the change in the process, called the change point, is very important for eliminating the source(s) of the change. Knowing when a process has ...

متن کامل

Optimal Scheduled Unit Commitment Considering Wind Uncertainty Using Cuckoo Search Algorithm

In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996